`:top

A `!range query`! is a common `F33f`_`[database`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Database]`_`f operation that retrieves all `F33f`_`[records`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Row_(database)]`_`f where some `F33f`_`[value`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Variable_(mathematics)]`_`f is between an upper and lower boundary.`:cite-ref-1[`F5bf`_`[1`#cite-note-1]`_`f] For example, list all employees with 3 to 5 years' experience. Range queries are unusual because it is not generally known in advance how many entries a range query will return, or if it will return any at all. Many other queries, such as the top ten most senior employees, or the newest employee, can be done more efficiently because there is an upper bound to the number of results they will return. A query that returns exactly one result is sometimes called a `F33f`_`[singleton`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Singleton_(mathematics)]`_`f.

>>Contents

• `F0af`_`[Partial match query`#partial-match-query]`_`f

• `F0af`_`[See also`#see-also]`_`f

• `F0af`_`[References`#references]`_`f

-─

>>Partial match query

Match at least one of the requested keys.

• `F33f`_`[B+ tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=B+_tree]`_`f

• `F33f`_`[k-d tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=K-d_tree]`_`f

• `F33f`_`[R-tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=R-tree]`_`f

>>See also

• `F33f`_`[Range searching`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Range_searching]`_`f

>>References

`:cite-note-1`!1.`! `F0af`_`[↑`#cite-ref-1]`_`f "SQL BETWEEN Operator". `*W3Schools`*. Retrieved 4 November 2014.

`c`F0af`_`[↑ Back to top`#top]`_`f`a